And-Or Dependence Graphs for Slicing Statecharts
نویسندگان
چکیده
The construction of an And-Or dependence graphs is illustrated, and its use in slicing statecharts is described. The additional structure allows for more precise slices to be constructed in the event of additional information, such as may be provided by static analysis and model checking, and with constraints on the global state and external events.
منابع مشابه
Statechart Slicing
The paper discusses how to reduce statecharts model by slicing. We start with the discussion of control dependencies and data dependencies in statecharts. The andor statechart dependence graph is introduced to represent control and data dependecies for statecharts. We show how to slice statecharts by using this dependence graph. Our slicing approach helps systems analysts and systems designers ...
متن کاملSlicing Aspect-Oriented Software
Program slicing has many applications in software engineering activities including program comprehension, debugging, testing, maintenance, and model checking. In this paper, we propose an approach to slicing aspect-oriented software. To solve this problem, we present a dependencebased representation called aspect-oriented system dependence graph (ASDG), which extends previous dependence graphs,...
متن کاملAbstract program slicing on dependence condition graphs
Program Slicing on Dependence Condition Graphs Raju Halder and Agostino Cortesi Università Ca’ Foscari Venezia, Italy {halder, cortesi}@unive.it Abstract Many slicing techniques have been proposed based on the traditional Program Dependence Graph (PDG) representation. In traditional PDGs, the notion of dependency between statements is based on syntactic presence of a variable in the definition ...
متن کاملSlicing Concurrent Java Programs
Although many slicing algorithms have been proposed for object-oriented programs, no slicing algorithm has been proposed which can be used to handle the problem of slicing concurrent Java programs correctly. In this paper, we propose a slicing algorithm for concurrent Java programs. To slice concurrent Java programs, we present a dependence-based representation called multithreaded dependence g...
متن کاملTerm Dependence Graphs 1
Program slicing is a method for decomposing programs by analyzing their data and control flow. It has many applications in the field of software engineering (like program debugging, testing, code reuse, maintenance, etc). The so called program dependence graph—a data structure that stores control and data dependences between the statements of imperative programs—is a key ingredient of many slic...
متن کامل